Finding Optimal Apertures inKeplerData

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal pupil apodizations of arbitrary apertures for high-contrast imaging.

In the context of exoplanet direct detection and characterization, where high-contrast imaging is mandatory, we present fully optimized two-dimensional pupil apodizations for which no specific geometric constraints are put on the pupil plane apodization, apart from the shape of the aperture itself. Masks for circular and segmented apertures are displayed, with and without a central obstruction ...

متن کامل

Finding an Optimal Team

This article proposes a metaheuristic optimization/social simulation approach to find the optimal team for a given type of the project. The quality of the team is assessed in a black-box optimization environment, where the optimized function acts as a metaphor of the project to be completed within the certain time limit (number of fitness function evaluations) and each fitness function evaluati...

متن کامل

Finding Optimal Flows Efficiently

Among the models of quantum computation, the One-way Quantum Computer [10, 11] is one of the most promising proposals of physical realization [12], and opens new perspectives for parallelization by taking advantage of quantum entanglement [2]. Since a one-way quantum computation is based on quantum measurement, which is a fundamentally nondeterministic evolution, a sufficient condition of globa...

متن کامل

Finding Optimal Bayesian Networks

In this paper, we derive optimality results for greedy Bayesian-network search algorithms that perform single-edge modi cations at each step and use asymptotically consistent scoring criteria. Our results extend those of Meek (1997) and Chickering (2002), who demonstrate that in the limit of large datasets, if the generative distribution is perfect with respect to a DAG de ned over the observab...

متن کامل

On Finding Optimal Polytrees

We study the NP-hard problem of finding a directed acyclic graph (DAG) on a given set of nodes so as to maximize a given scoring function. The problem models the task of inferring a probabilistic network from data, which has been studied extensively in the fields of artificial intelligence and machine learning. Several variants of the problem, where the output DAG is constrained in several ways...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publications of the Astronomical Society of the Pacific

سال: 2016

ISSN: 0004-6280,1538-3873

DOI: 10.1088/1538-3873/128/970/124501